Wireless network virtualization enables multiple virtual wireless networks tocoexist on shared physical infrastructure. However, one of the main challengesis the problem of assigning the physical resources to virtual networks in anefficient manner. Although some work has been done on solving the embeddingproblem for wireless networks, few solutions are applicable to dynamic networkswith changing traffic patterns. In this paper we propose a dynamic greedyembedding algorithm for wireless virtualization. Virtual networks can bere-embedded dynamically using this algorithm, enabling increased resource usageand lower rejection rates. We compare the dynamic greedy algorithm to a staticembedding algorithm and also to its dynamic version. We show that the dynamicalgorithms provide increased performance to previous methods using simulatedtraffic. In addition we formulate the embedding problem with multiple prioritylevels for the static and dynamic case.
展开▼
